On the Relative Importance of Arrival Statistics and Output Addressing for Shared-Buffer ATM Switches

نویسندگان

  • Simon Fong
  • Samar Singh
چکیده

Traffic arrival processes are the important ingredients for the performance evaluation of ATM switches. Three important aspects of traffic models are the arrival pattern, output address correlation and, output address (or hot-spot) distribution. Here we investigate the relative importance of selfsimilar traffic model vs bursty traffic model, under the various conditions of output addressing, and presence of a hot-spot on the performance of the switch. Simulation results and intuitive explanations of the results are presented. Our simulation results quantify the relative importance of the two issues. Although a self-similar input does result in a higher cell loss when the cells address the outputs independently and uniformly, the effect is almost completely masked in the presence of hot-spots and output address correlation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An accurate performance model of shared buffer ATM switches under hot spot traffic

Asynchronous transfer mode (ATM) switches based on shared buffering are known to have better performance and buffer utilization than input or output queued switches. Shared buffer switches do not suffer from head of line blocking which is a problem in simple input buffering. Shared buffer switches have previously been studied under uniform and unbalanced traffic patterns. However, due to the co...

متن کامل

M1, M2, ..., Mk/G1, G2,..., Gk/l/N Queue with Buffer Division and Push-Out Schemes for ATM Networks (RESEARCH NOTE)

In this paper, loss probabilities and steady state probabilities of data packets for an asynchronous transfer mode (ATM) network are investigated under the buffer division and push-out schemes. Data packets are classified in classes k which arrive in Poisson fashion to the service facility and are served with general service rate under buffer division scheme, finite buffer space N is divided in...

متن کامل

Optimally Efficient Simulation of Buffer Overflows in Queues with Deterministic Service Times via Impor- tance Sampling

Simply because of their rarity, the estimation of the statistics of bufer overflows in queueing systems via direct simulation is often very ezpensive in computer time. Past work on fast simulation using importance sampling has concentrated on systems with Poisson arrival processes and ezponentially distributed service times. However, in practical systems, such as ATM switches, service times are...

متن کامل

Optimal Simulation of Buffer Overflows in - Queueing Systems with Application to ATM Switches*

works is M/M/l queues and Jackson networks, and it is shown how one can find an asymptotically opSimply because of their rarity, the estimation of timal simulation system for simulating buffer overthe statistics of buffer overflows in queueing s y s flows in these systems. H ~ ~ ~ ~ ~ ~ , in con. terns via direct simulation is often very expensive figurations, it is more usual to have systems w...

متن کامل

VLSI design of a priority arbitrator for shared buffer ATM switches

Priority arbitration is an essential part of the ATM switches in order to support the integration of telecommunication services with difference characteristics. Service priority contral selects the connection to output a cell among all connections destined to the same ontput port. Discard priority contral selects the connection to discard a cell when the shared buffer is full. In this paper we ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007